Comparison of Non-Overlapping Domain Decomposition Methods for the Parallel Solution of Magnetic Field Problems
نویسندگان
چکیده
The aim of this paper is to give a unified comparison of non-overlapping domain decomposition methods (DDMs) for solving magnetic field problems. The methods under investigation are the Schur complement method and the Lagrange multiplier based Finite Element Tearing and Interconnecting (FETI) method, and their solvers. The performance of these methods has been investigated in detail for two-dimensional magnetic field problems as case studies.
منابع مشابه
Non-Fourier heat conduction equation in a sphere; comparison of variational method and inverse Laplace transformation with exact solution
Small scale thermal devices, such as micro heater, have led researchers to consider more accurate models of heat in thermal systems. Moreover, biological applications of heat transfer such as simulation of temperature field in laser surgery is another pathway which urges us to re-examine thermal systems with modern ones. Non-Fourier heat transfer overcomes some shortcomings of Fourier heat tran...
متن کاملA Parallel Overlapping Time-Domain Decomposition Method for ODEs
We introduce an overlapping time-domain decomposition for linear initial-value 7 problems which gives rise to an efficient solution method for parallel computers without 8 resorting to the frequency domain. This parallel method exploits the fact that homogeneous 9 initial-value problems can be integrated much faster than inhomogeneous problems by using 10 an efficient Arnoldi approximation for ...
متن کاملSignificant Error Propagation in the Finite Difference Solution of Non-Linear Magnetostatic Problems Utilizing Boundary Condition of the Third Kind
This paper poses two magnetostatic problems in cylindrical coordinates with different permeabilities for each region. In the first problem the boundary condition of the second kind is used while in the second one, the boundary condition of the third kind is utilized. These problems are solved using the finite element and finite difference methods. In second problem, the results of the finite di...
متن کاملNon-Overlapping Domain Decom- position Methods
Non-overlapping domain decomposition methods are well-established and efficient algorithms for the solution of the large algebraic systems arising from finite element or finite difference discretizations of elliptic partial differential equations. They are well adapted to modern parallel computer architectures since they split the original problem into independent problems on the subdomains, wh...
متن کاملStable, Gloablly Non-iterative, Non-overlapping Domain Decomposition Parallel Solvers for Parabolic Problems
In this paper, we report a class of stabilized explicit-implicit domain decomposition (SEIDD) methods for the parallel solution of parabolic equations, based on the explicit-implicit domain decomposition (EIDD) methods. EIDD methods are globally non-iterative, non-overlapping domain decomposition methods which, when compared with Schwarz alternating algorithm based parabolic solvers, are comput...
متن کامل